Fido: A Cache That Learns to Fetch
نویسندگان
چکیده
This paper describes Fido, a predictive cache [Palmer 19901 that prefetches by employing an associative memory to recognize access patterns within a context over time. Repeated training adapts the associative memory contents to data and access pattern changes, allowing on-line access predictions for prefetching. We discuss two salient elements of Fido MLP, a replacement policy for managing prefetched objects, and Estimating Prophet, the component that recognizes patterns and predicts access. We then present some early simulation results which suggest that predictive caching works well and conclude that it is a promising method.
منابع مشابه
Master ' s Thesis CS - 91 - M 12 A Data Cache that Learns to Fetch
This paper describes Fido, a predictive cache [palmer 1990] that anticipates access by em ploying an associative memory to recognize regularities in access pattern for each isolated access context over time. Continual training adapts the associative memory contents to data base and access pattern changes, allowing on line access predictions for prefetcbing. We dis cuss two salient component...
متن کاملAlternative Fetch and Issue Policies for the Trace Cache Fetch Mechanism Alternative Fetch and Issue Policies for the Trace Cache Fetch Mechanism
The increasing widths of superscalar processors are placing greater demands upon the fetch mechanism The trace cache meets these demands by placing logi cally contiguous instructions in physically contiguous storage It is capable of supplying multiple fetch blocks
متن کاملCache Scheme Based on Pre-Fetch Operation in ICN
Many recent researches focus on ICN (Information-Centric Network), in which named content becomes the first citizen instead of end-host. In ICN, Named content can be further divided into many small sized chunks, and chunk-based communication has merits over content-based communication. The universal in-network cache is one of the fundamental infrastructures for ICN. In this work, a chunk-level ...
متن کاملDesign of Trace Caches for High Bandwidth Instruction Fetching
In modern high performance microprocessors, there has been a trend toward increased superscalarity and deeper speculation to extract instruction level parallelism. As issue rates rise, more aggressive instruction fetch mechanisms are needed to be able to fetch multiple basic blocks in a given cycle. One such fetch mechanism that shows a great deal of promise is the trace cache, originally propo...
متن کاملOut-of-Order Instruction Fetch Using Multiple Sequencers
Conventional instruction fetch mechanisms fetch contiguous blocks of instructions in each cycle. They are difficult to scale since taken branches make it hard to increase the size of these blocks beyond eight instructions. Trace caches have been proposed as a solution to this problem, but they use cache space inefficiently. We show that fetching large blocks of contiguous instructions, or wide ...
متن کامل